Maximal-clique partitions of interval graphs
نویسندگان
چکیده
منابع مشابه
Clique Partitions of Glued Graphs
A glued graph at K2-clone (K3-clone) results from combining two vertex-disjoint graphs by identifying an edge (a triangle) of each original graph. The clique covering numbers of these desired glued graphs have been investigated recently. Analogously, we obtain bounds of the clique partition numbers of glued graphs at K2-clones and K3-clones in terms of the clique partition numbers of their orig...
متن کاملClique Partitions of Dense Graphs
In this paper, we prove that for any forest F ⊂ Kn, the edges of E(Kn)\E(F ) can be partitioned into O(n log n) cliques. This extends earlier results on clique partitions of the complement of a perfect matching and of a hamiltonian path in Kn. We also show that if a graph G has maximum degree 4, then the edges of E(Kn)\E(G) can be partitioned into roughly n 3 24 1 2 log n cliques provided there...
متن کاملAcyclic Clique-Interval Graphs
The class of acyclic clique-interval (ACI) graphs is introduced as the class of those graphs G=(V ,E) whose cliques are intervals (chains) of an acyclic order on the vertex set V . The class of ACI graphs is related to the classes of proper interval graphs, tree-clique graphs and to the class DV (intersection graphs of directed paths of a directed tree). Compatibility between a graph and an acy...
متن کاملClique coverings and partitions of line graphs
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique in C. The clique covering (partition) number cc(G) (cp(G)) of G is the minimum size of a clique covering (partition) of G. This paper gives alternative proofs, using a unified approach, for the results on the clique c...
متن کاملClique-width of unit interval graphs
The clique-width is known to be unbounded in the class of unit interval graphs. In this paper, we show that this is a minimal hereditary class of unbounded clique-width, i.e., in every hereditary subclass of unit interval graphs the clique-width is bounded by a constant.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1988
ISSN: 0263-6115
DOI: 10.1017/s1446788700030147